Markov Chains and Polynomial Time Algorithms
نویسنده
چکیده
This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes : combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets.
منابع مشابه
Evaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملApproximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique based on the simulation of ergodic Markov chains, it is shown that, for self-reducible structures, almost uniform generation is possible in polynomial time provided only that randomised approximate counting to within some arbitrary polynomial factor is possible in polyn...
متن کاملMaximum likelihood trajectories for continuous-time Markov chains
Continuous-time Markov chains are used to model systems in which transitions between states as well as the time the system spends in each state are random. Many computational problems related to such chains have been solved, including determining state distributions as a function of time, parameter estimation, and control. However, the problem of inferring most likely trajectories, where a traj...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملOn Computational Aspects of the Invariant Subspace Approach to Teletraac Problems and Comparisons
A large class of teletraac problems are based on Markov chains of M/G/1 and G/M/1 type, the study of which requires numerically eecient and reliable algorithms to solve the nonlinear matrix equations arising in such chains. Given A i ; i 0, a sequence of square m-by-m nonnegative matrices and A(z) = P 1 i=0 A i z i with A(1) being an irreducible stochastic matrix, these equations for M/G/1 type...
متن کامل